Recursive method for the Nekrasov partition function for classical Lie groups
نویسندگان
چکیده
منابع مشابه
Ω-Background and the Nekrasov Partition Function
In this talk we’ll aim to make sense of the Nekrasov partition function (as introduced in Nekrasov’s ICM address [Nek03]) as the partition function in a twisted deformed N = 2 gauge theory. While making the deformation is unnecessary – without it we’re just talking about the partition function in Donaldson-Witten theory – deforming the theory eliminates IR divergences, allowing a direct mathema...
متن کاملStabilized plethysms for the classical Lie groups
The plethysms of the Weyl characters associated to a classical Lie group by the symmetric functions stabilize in large rank. In the case of a power sum plethysm, we prove that the coefficients of the decomposition of this stabilized form on the basis of Weyl characters are branching coefficients which can be determined by a simple algorithm. This generalizes in particular some classical results...
متن کاملRecursive Moving Frames for Lie Pseudo-Groups
This paper introduces a new, fully recursive algorithm for computing moving frames and differential invariants of Lie pseudo-group actions. The recursive method avoids unwieldy symbolic expressions that complicate the treatment of large scale applications of the equivariant moving frame method. The development leads to novel results on partial moving frames, structure equations, and new differe...
متن کاملDouble Schubert polynomials for the classical Lie groups
For each infinite series of the classical Lie groups of type B, C or D, we introduce a family of polynomials parametrized by the elements of the corresponding Weyl group of infinite rank. These polynomials represent the Schubert classes in the equivariant cohomology of the corresponding flag variety. They satisfy a stability property, and are a natural extension of the (single) Schubert polynom...
متن کاملImplementation of the Recursive Core for Partition Function Form Games∗
In partition function form games, the recursive core (r-core) is implemented by a modified version of Perry and Reny’s (1994) non-cooperative game. Specifically, every stationary subgame perfect Nash equilibrium (SSPNE) outcome is an r-core outcome. With the additional assumption of total r-balancedness, every r-core outcome is an SSPNE outcome.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Progress of Theoretical and Experimental Physics
سال: 2015
ISSN: 2050-3911
DOI: 10.1093/ptep/ptv014